Canonical finite state machines for distributed systems
نویسندگان
چکیده
منابع مشابه
Canonical finite state machines for distributed systems
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multiple ports/interfaces a multi-port FSM is used and in testing a tester is placed at each port. If the testers cannot communicate with one another directly and there is no global clock then we are testing in the distribute...
متن کاملSelf-Stabilization in the Distributed Systems of Finite State Machines
The notion of self-stabilization was first proposed by Dijkstra in 1974 in his classic paper. The paper defines a system as self-stabilizing if, starting at any, possibly illegitimate, state the system can automatically adjust itself to eventually converge to a legitimate state in finite amount of time and once in a legitimate state it will remain so unless it incurs a subsequent transient faul...
متن کاملDiagnosing Distributed Systems Modeled by Communicating Finite State Machines
We propose a diagnostic algorithm for the case where a distributed system specification (implementation) is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which perm...
متن کاملCanonical forms for information-lossless finite-state logical machines
An important class of finite-state machines transforms input sequences of digits into output sequences in a way such that, after an experiment of any finite length on the machine, its input sequence may be deduced from a knowledge of the corresponding output sequence, its initial and final states, and the set of specifications for the transformations by which the machine produces output sequenc...
متن کاملLearning Finite State Machines
The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata formalisms, and particularly on determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.039